Obtaining Memory-Efficient Reachability Graph Representations Using the Sweep-Line Method
نویسندگان
چکیده
This paper is concerned with a memory-efficient representation of reachability graphs. We describe a technique that enables us to represent each reachable marking in a number of bits close to the theoretical minimum needed for explicit state enumeration. The technique maps each state vector onto a number between zero and the number of reachable states and uses the sweep-line method to delete the state vectors themselves. A prototype of the proposed technique has been implemented and experimental results are reported.
منابع مشابه
Reachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملModel Checking Based on Occurrence Net Graph
The computation of a reachability graph is one of the most used method to check system properties. Its main drawback is the state explosion. Two different approaches are generally used to tackle this problem: to define new concise graph representations for which verification methods are adapted; to reduce graphs while preserving observed properties. We propose a new representation of a reachabi...
متن کاملInvestigating Optimal Progress Measures for Verification of the WebSocket Protocol
The sweep-line method is a state space reduction technique for memory-efficient on-the-fly verification of concurrent systems. The method relies on a progress measure capturing inherent progress in the system under verification to store only fragments of the state space in memory at a time and thereby reduce peak memory usage. The sweepline method has been applied to many concurrent systems, bu...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملAnalysis of Planar Microstrip Circuits Using Three-Dimensional Transmission Line Matrix Method
The frequency-dependent characteristics of microstrip planar circuits have been previously analyzed using several full-wave approaches. All those methods directly give characteristic of the circuits frequency by frequency. Computation time becomes important if these planar circuits have to be studied over a very large bandwidth. The transmission line matrix (TLM) method presented in this paper ...
متن کامل